Data Dissemination And Information Diffusion In Social Networks

Data dissemination problem is a challenging issue in social networks, especially in mobile social networks, which grows rapidly in recent years worldwide with a significant increasing number of hand-on mobile devices such as smart phones and pads. Short-range radio communications equipped in mobile devices enable mobile users to access their interested contents not only from access points of Internet but also from other mobile users. Through proper data dissemination among mobile users, the bandwidth of the short-range communications can be better utilized and alleviate the stress on the bandwidth of the cellular networks. In this dissertation proposal, data dissemination problem in mobile social networks is studied. Before data dissemination emerges in the research of mobile social networks, routing protocol of finding efficient routing path in mobile social networks was the focus, which later became the pavement for the study of the efficient data dissemination. Data dissemination priorities on packet dissemination from multiple sources to multiple destinations while routing protocol simply focus on finding routing path between two ends in the networks. The first works in the literature of data dissemination problem were based on the modification and improvement of routing protocols in mobile social networks. Therefore, we first studied and proposed a prediction-based routing protocol in delay tolerant networks. Delay tolerant network appears earlier than mobile social networks. With respect to delay tolerant networks, mobile social networks also consider social patterns as well as mobility patterns. In our work, we simply come up with the prediction-based routing protocol through analysis of user mobility patterns. We can also apply our proposed protocol in mobile social networks. Secondly, in literature, efficient data dissemination schemes are proposed to improve the data dissemination ratio and with reasonable overhead in the networks. However, the overhead may be not well controlled in the existing works. A social-aware data dissemination scheme is proposed in this dissertation proposal to study efficient data dissemination problem with controlled overhead in mobile social networks. The data dissemination scheme is based on the study on both mobility patterns and social patterns of mobile social networks. Thirdly, in real world cases, an efficient data dissemination in mobile social networks can never be realized if mobile users are selfish, which is true unfortunately in fact. Therefore, how to strengthen nodal cooperation for data dissemination is studied and a credit-based incentive data dissemination protocol is also proposed in this dissertation. Data dissemination problem was primarily researched on mobile social networks. When consider large social networks like online social networks, another similar problem was researched, namely, information diffusion problem. One specific problem is influence maximization problem in online social networks, which maximize the result of information diffusion process. In this dissertation proposal, we proposed a new information diffusion model, namely, sustaining cascading (SC) model to study the influence maximization problem and based on the SC model, we further plan our research work on the information diffusion problem aiming at minimizing the influence diffusion time with subject to an estimated influence coverage

Reliable H∞ control for discrete-time piecewise linear systems with infinite distributed delays

In this paper, the reliable H∞ control problem is investigated for discrete-time piecewise linear systems with time delays and actuator failures. The time delays are assumed to be infinitely distributed in the discrete-time domain, and the possible failure of each actuator is described by a variable varying in a given interval. The aim of the addressed reliable H∞ control problem is to design a controller such that, for the admissible infinite distributed delays and possible actuator failures, the closed-loop system is exponentially stable with a given disturbance attenuation level γ. The controller gain is characterized in terms of the solution to a linear matrix inequality that can be easily solved by using standard software packages. A simulation example is exploited in order to illustrate the effectiveness of the proposed design procedures

A Sentiment-Change-Driven Event Discovery System

We present a system that automatically discovers important events that have significantly driven people’s sentiment changes towards a target using Twitter data (i.e. tweets). This system can also provide the time, importance, and description of events that are associated with people’s sentiment changes. In this system, a sentiment classifier is used as the sensor to detect the time points of those changes. It is also used as the filter to effectively eliminate a considerable amount of noisy information and select the most informative tweets to be further analyzed for event descriptions. Discovered events are described from the following aspects, 1) the most important tweets ranked by tweet-based TextRank algorithm, 2) the topics generated by the nonnegative matrix factorization, and 3) the most important keywords generated by word-based TextRank algorithm. Compared with traditional event discovery techniques, the experimental results show that this system can effectively discover important patterns from tweets and unveil 3Ws of an event (i.e. what happens, when it happens, what its effect is), which provides good reference on understanding behavior changes and making strategies. Furthermore, the system was applied to analyze people’s sentiment changes towards the two candidates during the 2016 U.S. presidential election. It can also be applied in other scenarios where people’s attitude plays an important role like the brand influence marketing and financial investment markets

Distributed human 3D pose estimation and action recognition.

In this paper, we propose a distributed solution for3D human pose estimation using a RGBD camera network. Thekey feature of our method is a dynamic hybrid consensus filter(DHCF) is introduced to fuse the multiple view informationof cameras. In contrast to the centralized fusion solution,the DHCF algorithm can be used in a distributed network,which requires no central information fusion center. Therefore,the DHCF based fusion algorithm can benefit from manyadvantages of distributed network. We also show that theproposed fusion algorithm can handle the occlusion problemseffectively, and achieve higher action recognition rate comparedto the ones using only single view information

The Correspondence between Convergence Peaks from Weak Lensing and Massive Dark Matter Haloes

The convergence peaks, constructed from galaxy shape measurement in weak lensing, is a powerful probe of cosmology as the peaks can be connected with the underlined dark matter haloes. However the capability of convergence peak statistic is affected by the noise in galaxy shape measurement, signal to noise ratio as well as the contribution from the projected mass distribution from the large-scale structures along the line of sight (LOS). In this paper we use the ray-tracing simulation on a curved sky to investigate the correspondence between the convergence peak and the dark matter haloes at the LOS. We find that, in case of no noise and for source galaxies at $z_{\rm s}=1$, more than $65\%$ peaks with $\text{SNR} \geq 3$ (signal to noise ratio) are related to more than one massive haloes with mass larger than $10^{13} {\rm M}_{\odot}$. Those massive haloes contribute $87.2\%$ to high peaks ($\text{SNR} \geq 5$) with the remaining contributions are from the large-scale structures. On the other hand, the peaks distribution is skewed by the noise in galaxy shape measurement, especially for lower SNR peaks. In the noisy field where the shape noise is modelled as a Gaussian distribution, about $60\%$ high peaks ($\text{SNR} \geq 5$) are true peaks and the fraction decreases to $20\%$ for lower peaks ($3 \leq \text{SNR} < 5$). Furthermore, we find that high peaks ($\text{SNR} \geq 5$) are dominated by very massive haloes larger than $10^{14} {\rm M}_{\odot}$.Comment: 13 pages, 11 figures, 4 tables, accepted for publication in MNRAS. Our mock galaxy catalog is available upon request by email to the author ([email protected]